Task Scheduling in Cloud Computing: A Priority-Based Heuristic Approach

In this paper, a task scheduling problem for cloud computing environment is formulated by using the M/M/n queuing model. A priority assignment algorithm designed to employ new data structure named waiting time matrix assign individual tasks upon arrival. addition this, queue implements unique concept based on principle of Fibonacci heap extracting with highest priority. This work introduces parallel in which and building executed respect non-preemptive preemptive nature tasks. The proposed illustrated step-by-step manner an appropriate number performance model compared terms overall CPU against some existing techniques like BATS, IDEA, BATS+BAR determine efficacy our algorithms. Additionally, three distinct scenarios have been considered demonstrate competency method handling different priorities. Furthermore, also applied dynamic environment.